|
Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Bedminster, New Jersey, United States.〔(Lund's home page at AT&T ).〕 Lund was born in Aarhus, Denmark, and received the "kandidat" degree in 1988 from the University of Aarhus and his Ph.D. from the University of Chicago in computer science. His thesis, entitled The Power of Interaction, was chosen as an ACM 'Distinguished Dissertation'. Lund was a co-author on two of five competing papers at the 1990 Symposium on Foundations of Computer Science characterizing complexity classes such as PSPACE and NEXPTIME in terms of interactive proof systems;〔.〕〔. Later published in JACM, 1991, .〕〔. Later published in Computational Complexity, 1991, .〕 this work became part of his 1991 Ph.D. thesis from the University of Chicago under the supervision of Lance Fortnow and László Babai,〔.〕 for which he was a runner-up for the 1991 ACM Doctoral Dissertation Award.〔.〕 He is also known for his joint work with Sanjeev Arora, Madhu Sudan, Rajeev Motwani, and Mario Szegedy that discovered the existence of probabilistically checkable proofs for NP-hard problems and used them to prove hardness results for approximation problems;〔.〕〔. Originally presented at the 1992 Symposium on Foundations of Computer Science, .〕 in 2001 he and his co-authors received the Gödel Prize for their share in these discoveries.〔.〕 More recently he has published highly cited work on internet traffic engineering.〔.〕〔.〕 He has been working for AT&T Laboratories since August 1991.〔http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.50.6215&rep=rep1&type=pdf IEEE Journal on Selected Areas in Communications, Vol. 13, No. 8, October 1995〕 ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Carsten Lund」の詳細全文を読む スポンサード リンク
|